The parcel hub scheduling problem with limited conveyor capacity and controllable unloading speeds

نویسندگان

چکیده

Abstract We investigate a specific truck scheduling problem at cross-docks in the postal service industry on an operational level aiming to maximise number of duly parcels assuming fixed departure times outbound trucks. The inbound gates and conveyors as means transportation inside hub constitute bottleneck resources. As novel extension, we propose flexible unloading speeds efficiently utilise scarce formalise with mixed integer program explicitly incorporate controllable determine computational complexity develop genetic algorithm solve problem. Our investigation focuses both performance applicability results real-world environment by implementing policies simulation model that considers individual parcel interactions. Based our experimental results, can state especially settings conveyor capacities, approach has potential significantly increasing parcels.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Two machine mixed shop scheduling problem with controllable machine speeds

This paper considers a scheduling problem in which the objective is to determine an optimal machine speed pair and an optimal schedule. There are two machines A, B and n jobs each of which consists of two operations. One operation is to be processed on machine A and the other on machine B. All jobs are open shop type, i.e., processing order of two operations is not specified and so processing o...

متن کامل

Two Machine Flow Shop Scheduling Problem with No Wait in Process: Controllable Machine Speeds

The paper considers a two machine flow shop scheduling problem with no wait in process. The objective is to find the optimal values of machine speeds and to determine the time-optimal schedule. There are two machines, A and B, and a set of n jobs each consisting of two operations. The first operation of each job is to be processed on machine A and the second on machine B. For each feasible sche...

متن کامل

Hub Covering Location Problem Considering Queuing and Capacity Constraints

In this paper, a hub covering location problem is considered. Hubs, which are the most congested part of a network, are modeled as M/M/C queuing system and located in placeswhere the entrance flows are more than a predetermined value.A fuzzy constraint is considered in order to limit the transportation time between all origin-destination pairs in the network.On modeling, a nonlinear mathematica...

متن کامل

Solving the Problem of Scheduling Unrelated Parallel Machines with Limited Access to Jobs

Nowadays, by successful application of on time production concept in other concepts like production management and storage, the need to complete the processing of jobs in their delivery time is considered a key issue in industrial environments. Unrelated parallel machines scheduling is a general mood of classic problems of parallel machines. In some of the applications of unrelated parallel mac...

متن کامل

Solving the Problem of Scheduling Unrelated Parallel Machines with Limited Access to Jobs

Nowadays, by successful application of on time production concept in other concepts like production management and storage, the need to complete the processing of jobs in their delivery time is considered a key issue in industrial environments. Unrelated parallel machines scheduling is a general mood of classic problems of parallel machines. In some of the applications of unrelated parallel mac...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: OR Spectrum

سال: 2023

ISSN: ['0171-6468', '1436-6304']

DOI: https://doi.org/10.1007/s00291-022-00702-y